Checking Redundancies in Supervisory Control. a Complexity Result
نویسندگان
چکیده
The iterative nature of state feedback control appoaches based on the addition of control places (in Petri net models), can give rise to redundancies in the added control. These redundancies are characterised as implicit places. In this paper we prove that deciding the implicitness of a place added to a live marked graph is of polynomial complexity.
منابع مشابه
Supervisory control theory in epistemic temporal logic
Supervisory control theory deals with problems related to the existence and the synthesis of supervisors. The role of a supervisor in a system is to control and restrict the behavior of this system in order to realize a specific behavior. When there are multiple supervisors, such systems are in fact multi-agent systems. The results of supervisory control theory are usually expressed in terms of...
متن کاملA Framework for Supervisory Control of Probabilistic Discrete Event Systems
This paper focuses on a framework for probabilistic supervisory control of probabilistic discrete event systems (PDES). PDES are modelled as generators of probabilistic languages, and the supervisors used are probabilistic. In our previous work, we presented and solved a number of supervisory control problems inside the framework. We also suggested a pseudometric to measure the behavioural simi...
متن کاملA μ-Calculus Approach to Supervisor Synthesis
We present a new formulation to the solution of the supervisory control problem proposed by Ramadge and Wonham. The objective of that problem is to synthesise a controller which constrains a system’s behaviour according to a given specification. We reformulate the solution using set of μ-calculus equations. This makes it independent of any natural or programming languages and allows us to use w...
متن کاملSupervisory Control of Discrete-Event Systems via IC3
The IC3 algorithm has proven to be an effective SAT-based safety model checker. It has been generalized to other frameworks such as SMT and applied very successfully to hardware and software model checking. In this paper, we present a novel technique for the supervisory control of discrete-event systems with infinite state space via IC3. We introduce an algorithm for synthesizing maximally perm...
متن کاملInfinite Games in Epistemic Temporal Logic via Supervisory Control Theory
We embed the framework of infinite two-player turn-based games played on graphs with safety objectives in an epistemic temporal logic. This embedding is made possible thanks to two intermediate embeddings: the first is from infinite games with safety objectives to supervisory control theory and the second is from supervisory control theory to epistemic temporal logic. Thereby, we are able to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002